Intransitively winning chess players' positions
نویسندگان
چکیده
Chess players' positions in intransitive (rock-paper-scissors) relations are considered. Namely, position $A$ of White is preferable (it should be chosen if choice possible) to $B$ Black, Black $C$ White, $D$ but White. Intransitivity winningness chess considered a consequence complexity the environment - contrast with simpler games transitive only. Perfect values impossible. Euclidian metric cannot used describe space relations. The Zermelo-von Neumann theorem complemented by statements about possibility vs. impossibility building pure winning strategies based on assumption transitivity positions. Questions other positional raised.
منابع مشابه
Classifying Chess Positions
Chess was one of the first problems studied by the AI community. While currently, chessplaying programs perform very well using primarily search-based algorithms to decide the best move to make, in this project I apply machine-learning algorithms to this problem. Specifically, instead of choosing which move is the best to make, I want to produce an function that attempts to determine the probab...
متن کاملAuditory memory function in expert chess players
Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...
متن کاملWinning Positions in Simplicial Nim
Simplicial Nim, introduced by Ehrenborg and Steingŕımsson, is a generalization of the classical two-player game of Nim. The heaps are placed on the vertices of a simplicial complex and a player’s move may affect any number of piles provided that the corresponding vertices form a face of the complex. In this paper, we present properties of a complex that are equivalent to the P-positions (winnin...
متن کاملWinning Strategies in Multimove Chess (i, j)
We propose a class of chess variants, Multimove Chess (i, j), in which White gets i moves per turn and Black gets j moves per turn. One side is said to win when it takes the opponent’s king. All other rules of chess apply. We prove that if (i, j) is not (1, 1) or (2, 2), and if i ≥ min( j, 4), then White always has a winning strategy, and if i < min( j, 4), Black always has a winning strategy.
متن کاملVisuospatial abilities of chess players.
The extent to which the acquisition of expertise in knowledge-rich domains, such as chess, can be influenced by general individual characteristics, such as intelligence, has remained unclear. Some previous studies with children have documented significant correlations between chess skill and performance on some psychometric tests, such as performance IQ. However, we found no evidence for a corr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ?????????????? ?????? ??? ? ?ë ??????????
سال: 2023
ISSN: ['2074-9872']
DOI: https://doi.org/10.17076/mgta_2022_3_57